Solving Program Sketches with Large Integer Values

Program sketching is a program synthesis paradigm in which the programmer provides partial with holes and assertions. The goal of synthesizer to automatically find integer values for so that resulting satisfies most popular tool, Sketch , can efficiently solve complex sketches but uses an encoding often performs poorly if sketched manipulates large values. In this article, we propose new solving technique allows handle while retaining its encoding. Our result from number theory, Chinese Remainder Theorem, rewrite only track remainders certain variable respect several prime numbers. We prove our transformation sound programs are exponentially more succinct than existing encodings. evaluate on variety benchmarks manipulating speedups against both solvers cannot handle.